conflict graph
英 [ˈkɒnflɪkt ɡræf]
美 [ˈkɑːnflɪkt ɡræf]
网络 冲突图; 干扰图; 矛盾图
双语例句
- A concurrency control algorithm based on the transaction conflict graph is proposed.
提出了一种基于事务冲突图的并发控制方法。 - Conflict Graph Based MAC Protocol for Ad Hoc Wireless Networks
基于干扰图的无线自组织网络MAC协议 - To verify the structural correctness, a structural conflict verification method of workflow models based on graph reduction is introduced in this paper. With this method, we can figure out all structural conflicts of workflow model.
为了保证工作流模型的结构正确性，本文采用了一种基于图归约法的工作流模型结构冲突检测方法，该方法可以成功的检测出工作流模型中存在的各种结构冲突； - Syntax correctness is easy to verify, but structural correctness is difficult to verify. A structural conflict verification method of workflow mode based on graph reduction is introduced in this paper.
语法正确性比较易于证明，而结构正确性的证明则较难，本文采用了一种基于图归约法的工作流模型结构冲突验证方法，该方法可以检测出工作流模型中存在的各种结构冲突。 - In case of graph G representing a conflict relation, the following dual problem is proposed: to embed G into a host graph H such that the minimum stretch of the edges of G is maximized.
当图G表示一种冲突关系时，便提出如下的对偶问题：将图G嵌入于主图H，使得边的最小跨度达到最大。 - Using this algorithm, we can know the chance for combining and how to exchange, and the use of precedences enables us to reduce the size of the conflict graph for global deadlock detections.
确定了结合的较佳时机以及如何进行转换；并提出了采用标定优先级的方法来缩减用于全局死锁检测的冲突图的规模。 - Based on this, the paper gives the algorithm for judging strict conflict free and β acyclic decomposition in mixed environment, then shows that the complexity of the algorithm is linear using an example based on line graph.
据此，给出了判断严格无冲突及混合环境下无β环分解算法，并分析了算法时间的复杂度是线性的.最后，给出基于线图的实例验证。 - We introduce the concept of conflict graph and divide the register allocation problem under such two-source-operand constraints into two sub problems: the bank assignment subproblem and the register allocation subproblem.
我们提出了冲突图概念，并把这种双操作数冲突约束下的寄存器分配问题分解为二个子问题：组指派子问题和寄存器分配子问题。 - The main contributions of this thesis are as follows: ( 1) A conflict graph model is built to analyse the network. According to the transmission modes of the network, multi-object programming model including the fairness and throughput performances is established.
本文主要的贡献包括：（1）利用冲突图思想分析多速率多功率的WMN网络，把网络的传输状态分为多个不同的传输模式，并建立以吞吐率和公平性为目标的数学模型。 - For single channel, this thesis proposed centralized scheduling algorithm based on the network conflict graph and distributed scheduling algorithm based on the cooperation of nodes.
在单信道方面，提出了基于网络冲突图的集中式调度方法和基于节点协作的分布式调度方法。 - The former is attacked by 2-coloring the conflict graph and the latter is attacked by K-coloring the interference graph.
前者通过对冲突图2-着色解决，后者通过对干涉图K-着色解决。 - Conflict between intelligent vehicles is described by using field graph tool.
首先，利用场图工具建立路口车辆冲突模型。